Shuffle Exchange Network in Multistage Interconnection Network: A Review and Challenges
نویسندگان
چکیده
منابع مشابه
Multistage Interconnection Network Reliability
the input transitions at t = t 1 and t = f Z imply a pulse at the input port Il of the component. The mechanism is illustrated through an example presented subsequently. ns and the input signals at ports A and B. Although both of the input signals at A and B are logical 1 and 2 ns in width that is much larger than t p / h = 0.5 ns, the overlapping region where both inputs are high constitutes a...
متن کاملA Hierarchical Multistage Interconnection Network
Multistage interconnection networks are used in many applications ranging from connecting processors to memory modules in a parallel processing system, to high-speed network switches and routers. One of the major drawbacks in multistage networks is the lack of proximity concept. All nodes are at the same distance from any other node. In this paper, we propose a new hierarchical Multistage Netwo...
متن کاملMINSimulate – A MULTISTAGE INTERCONNECTION NETWORK SIMULATOR
Multistage interconnection networks are frequently proposed as connections in multiprocessor systems or network switches. In this paper, a new tool for stochastic simulation of such networks is presented. Simple crossbars can be simulated as well as multistage interconnection networks that are arranged in multiple layers.
متن کاملImproved Meta-Flattened Butterfly Multistage Interconnection Network
Parallel processing is efficient form of information processing which means to implement high performance computing systems. A communication network that links processors and memory modules determines the efficiency of these parallel systems. To provide the required connectivity and performance at reasonable cost, an interconnection network is used. Hence, multistage interconnection networks ar...
متن کاملOn The Shuffle-Exchange Permutation Network
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm with an upper bound of (5/8)n + O(n), where n is the length of the permutation. (This improves on a (9/8)n routing algorithm described earlier [5].) Thus, the diameter of SEPn is at most (5/8) n 2 + O(n). We also show th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer and Electrical Engineering
سال: 2011
ISSN: 1793-8163
DOI: 10.7763/ijcee.2011.v3.411